New Constructions of Sidon Spaces and Cyclic Subspace Codes
نویسندگان
چکیده
Sidon space is an important tool for constructing cyclic subspace codes. In this letter, we construct some spaces by using primitive elements and the roots of irreducible polynomials over finite fields. Let q be a prime power, k, m, n three positive integers $\rho= \lceil \frac{m}{2k}\rceil-1$, $\theta= \frac{n}{2m}\rceil-1$. Based on these union spaces, new codes with size $\frac{3(q^{n}-1)}{q-1}$ $\frac{\theta\rho q^{k}(q^{n}-1)}{q-1}$ are obtained. The lager compared to known constructions from [14] [10].
منابع مشابه
Construction of Sidon spaces with applications to coding
A subspace of a finite extension field is called a Sidon space if the product of any two of its elements is unique up to a scalarmultiplier from the base field. Sidon spaces were recently introduced by Bachoc et al. as a means to characterize multiplicativeproperties of subspaces, and yet no explicit constructions were given. In this paper, several constructions of Sidon spaces arep...
متن کاملOn quasi-cyclic subspace codes
Construction of subspace codes with good parameters is one of the most important problems in random network coding. In this paper we present first a generalization of the concept of cyclic subspaces codes and further we show that the usual methods for constructing cyclic subspace codes over finite fields works for m-quasi cyclic codes, namely the subspaces polynomials and Frobenius mappings.
متن کاملConstructions of generalized Sidon sets
We give explicit constructions of sets S with the property that for each integer k, there are at most g solutions to k = s1 + s2, si ∈ S; such sets are called Sidon sets if g = 2 and generalized Sidon sets (or B2[ ⌈ g/2 ⌉ ] sets) if g ≥ 3. We extend to generalized Sidon sets the Sidon-set constructions of Singer, Bose, and Ruzsa. We also further optimize Koulantzakis’ idea of interleaving sever...
متن کاملSome constructions of subspaces cyclic and quasi-cyclic codes
In this paper we construct, using GAP System for Computational Discrete Algebra, some cyclic subspace codes, specially an optimal code over the finite field F210 . Further we present a definition and an example of the q-analogous of a m-quasi-cyclic subspace code over F28 .
متن کاملConstructions of cyclic constant dimension codes
Subspace codes and particularly constant dimension codes have attracted much attention in recent years due to their applications in random network coding. As a particular subclass of subspace codes, cyclic subspace codes have additional properties that can be applied efficiently in encoding and decoding algorithms. It is desirable to find cyclic constant dimension codes such that both the code ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences
سال: 2023
ISSN: ['1745-1337', '0916-8508']
DOI: https://doi.org/10.1587/transfun.2022eal2074